package com.example.demo.test.leetcode.day1201;

import java.util.Arrays;
import java.util.PriorityQueue;

public class Solution1201 {
    public static void main(String[] args) {
        System.out.println(Arrays.toString(searchRange(new int[]{5, 7, 7, 8, 8, 10}, 7)));
    }

    public static int[] searchRange(int[] nums, int target) {
        // 小堆
        PriorityQueue<Integer> integerPriorityQueue = new PriorityQueue<>();


        return new int[]{1,2};
    }
}


